Topology and Holonomy in Discrete-time Quantum Walks
نویسنده
چکیده
We present a research article which formulates the milestones for the understanding and characterization of holonomy and topology of a discrete-time quantum walk architecture, consisting of a unitary step given by a sequence of two non-commuting rotations in parameter space. Unlike other similar systems recently studied in detail in the literature, this system does not present continous 1D topological boundaries, it only presents a discrete number of Dirac points where the quasi-energy gap closes. At these discrete points, the topological winding number is not defined. Therefore, such discrete points represent topological boundaries of dimension zero, and they endow the system with a non-trivial topology. We illustrate the non-trivial character of the system by calculating the Zak phase. We discuss the prospects of this system, we propose a suitable experimental scheme to implement these ideas, and we present preliminary experimental data.
منابع مشابه
Quantum Walks
Quantum walks can be considered as a generalized version of the classical random walk. There are two classes of quantum walks, that is, the discrete-time (or coined) and the continuous-time quantum walks. This manuscript treats the discrete case in Part I and continuous case in Part II, respectively. Most of the contents are based on our results. Furthermore, papers on quantum walks are listed ...
متن کاملThermalization in Many-Particle Quantum Walks
We present many-particle quantum walks on graphs. This study brings together the concepts of many-particles, multimode and indistinguishability to discrete quantum walks. Our scheme is independent of the topology of the graphs: linear, planar or spatial. We use the concepts of position field operators, adjacency matrix and the results of group theory to construct many particle systems on graphs...
متن کاملFormal languages analysed by quantum walks
Discrete time quantum walks are known to be universal for quantum computation. This has been proven by showing that they can simulate a universal gate set. In this paper we examine computation in terms of language acceptance and present two ways in which discrete time quantum walks can accept some languages with certainty. These walks can take quantum as well as classical inputs, and we show th...
متن کاملLocalization of Discrete Time Quantum Walks on the Glued Trees
In this paper, we consider the time averaged distribution of discrete time quantum walks on the glued trees. In order to analyze the walks on the glued trees, we consider a reduction to the walks on path graphs. Using a spectral analysis of the Jacobi matrices defined by the corresponding random walks on the path graphs, we have a spectral decomposition of the time evolution operator of the qua...
متن کاملThe expressive power of quantum walks in terms of language acceptance
Discrete time quantum walks are known to be universal for quantum computation. This has been proven by showing that they can simulate a universal quantum gate set. In this paper, we examine computation by quantum walks in terms of language acceptance, and present two ways in which discrete time quantum walks can accept some languages with certainty. These walks can take quantum as well as class...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017